Search results for " leapfrog method"
showing 3 items of 3 documents
Numerical Investigations of an Implicit Leapfrog Time-Domain Meshless Method
2014
Numerical solution of partial differential equations governing time domain simulations in computational electromagnetics, is usually based on grid methods in space and on explicit schemes in time. A predefined grid in the problem domain and a stability step size restriction need. Recently, the authors have reformulated the meshless framework based on smoothed particle hydrodynamics, in order to be applied for time domain electromagnetic simulation. Despite the good spatial properties, the numerical explicit time integration introduces, also in a meshless context, a severe constraint. In this paper, at first, the stability condition is addressed in a general way by allowing the time step inc…
Unconditionally stable meshless integration of time-domain Maxwell’s curl equations
2015
Grid based methods coupled with an explicit approach for the evolution in time are traditionally adopted in solving PDEs in computational electromagnetics. The discretization in space with a grid covering the problem domain and a stability step size restriction, must be accepted. Evidence is given that efforts need for overcoming these heavy constraints. The connectivity laws among the points scattered in the problem domain can be avoided by using meshless methods. Among these, the smoothed particle electromagnetics, gives an interesting answer to the problem, overcoming the limit of the grid generation. In the original formulation an explicit integration scheme is used providing, spatial a…
A brief overview on the numerical behavior of an implicit meshless method and an outlook to future challenges
2015
In this paper recent results on a leapfrog ADI meshless formulation are reported and some future challenges are addressed. The method benefits from the elimination of the meshing task from the pre-processing stage in space and it is unconditionally stable in time. Further improvements come from the ease of implementation, which makes computer codes very flexible in contrast to mesh based solver ones. The method requires only nodes at scattered locations and a function and its derivatives are approximated by means of a kernel representation. A perceived obstacle in the implicit formulation is in the second order differentiations which sometimes are eccesively sensitive to the node configurat…